From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures
نویسندگان
چکیده
We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Constructions, which truly extends CIC by building in arbitrary first-order decision procedures: deduction is still in charge of the CIC kernel, while computation is outsourced to dedicated first-order decision procedures that can be taken from the shelves provided they deliver a proof certificate. The soundness of the whole system becomes an incremental property following from the soundness of the certificate checkers and that of the kernel. A detailed example shows that the resulting style of proofs becomes closer to that of the working mathematician.
منابع مشابه
Integration of Decision Procedures into High - Order Interactive
INTEGRATION OF DECISION PROCEDURES INTO HIGH-ORDER INTERACTIVE PROVERS by Yegor Bryukhov Adviser: Professor Sergei Artemov An efficient proof assistant uses a wide range of decision procedures, including automatic verification of validity of arithmetical formulas with linear terms. Since the final product of a proof assistant is a formalized and verified proof, it prompts an additional task of ...
متن کاملA Small Framework for Proof Checking
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from the strength of first order theorem provers in the formalization of realistic formal proofs. In order to obtain this, we restricted the use of higher order constructs to a minimum. In particular, we refrained from λ no...
متن کاملA Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic
Building on work by Wainer and Wallen, formalised by James Margetson, we present soundness and completeness proofs for a system of first order logic. The completeness proofs naturally suggest an algorithm to derive proofs. This algorithm can be implemented in a tail recursive manner. We provide the formalisation in Isabelle/HOL. The algorithm can be executed via the rewriting tactics of Isabell...
متن کاملQuranic way of presenting proofs for God`s existence
Regardless of the view of those philosophers like Plantinga who see no need in any proof for the existence of God, scholars have presented four views on Quranic way of proving the existence of God including demonstration, awakening, implication and clear demonstration. Describing and criticizing the views in detail, the author has viewed differently. God has regarded the level of the addressee`...
متن کاملProof Certificates for Equality Reasoning
The kinds of inference rules and decision procedures that one writes for proofs involving equality and rewriting are rather different from proofs that one might write in first-order logic using, say, sequent calculus or natural deduction. For example, equational logic proofs are often chains of replacements or applications of oriented rewriting and normal forms: logical connectives then play mi...
متن کامل